A Framework for Processing Keyword-based Queries in Relational Databases
نویسنده
چکیده
The large sizes of existing databases are rapidly increasing with time. In this environment, there is a need to help users, who are usually not familiar with SQL statements and the schema of a database, in getting the information sorted according to their relevancy. In response to this need, many researchers have introduced the capability of querying a database based on a list of keywords. A user does not have to state a full SQL query, but just provide the list of keywords that seem to be of interest. The system would then return the relevant records from different tables that appear to be close to what the user is looking for, based on the list of keywords that he/she provides. However, there is a need to improve the efficiency and effectiveness of existing systems. In this paper, we introduce a framework for processing keywords-based queries that improves the efficiency and effectiveness. In addition, the performance results are presented.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملScalable Continual Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying database schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term in...
متن کاملProcessing Recommender Top-N Queries in Relational Databases
According to the feedback information from a user in the result sets of initial or previous queries, we present in this paper a framework for processing recommender top-N queries in relational databases. Based on the techniques and ranking strategies of keyword search, this framework returns top-N results for an initial query given by the user. As soon as he or she selects some of the top-N res...
متن کاملData Extraction from Structured Databases using Keyword-based Queries
Relational databases are used to store a large quantity of data scattered around the world. However, users face difficulties in accessing such data for lack of a more natural way of specifying queries. Techniques that use natural language words to search different information sources on the Web are now very common, but they cannot be employed to search relational databases. This work proposes a...
متن کاملA Hidden Markov Model Approach to Keyword-Based Search over Relational Databases
We present a novel method for translating keyword queries over relational databases into SQL queries with the same intended semantic meaning. In contrast to the majority of the existing keyword-based techniques, our approach does not require any a-priori knowledge of the data instance. It follows a probabilistic approach based on a Hidden Markov Model for computing the top-K best mappings of th...
متن کاملFuzzy multi-criteria selection procedures in choosing data source
Technology assessment and selection has a substantial impact on organizations procedures in regards to technology transfer. Technological decisions are usually made by a group of experts, and whereby integrity of these viewpoints to a single decision can be quite complex. Today, operational databases and data warehouses exist to manage and organize data with specific features and henceforth, th...
متن کامل